Single Vehicle Routing with Stochastic Demands: Approximate Dynamic Programming
نویسندگان
چکیده
منابع مشابه
Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands
The paper considers a version of the vehicle routing problem where customers' demands are uncertain. The focus is on dynamically routing a single vehicle to serve the demands of a known set of geographically dispersed customers during real-time operations. The goal consists of minimizing the expected distance traveled in order to serve all customers' demands. Since actual demand is revealed upo...
متن کاملStochastic Approach to Vehicle Routing Problem: Development and Theories
Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...
متن کاملAn approximate dynamic programming approach for the vehicle routing problem with stochastic demands
This paper examines approximate dynamic programming algorithms for the single-vehicle routing problem with stochastic demands from a dynamic or reoptimization perspective. The methods extend the rollout algorithm by implementing different base sequences (i.e. a priori solutions), look-ahead policies, and pruning schemes. The paper also considers computing the cost-to-go with Monte Carlo simulat...
متن کاملAn Inventory Routing Problem for Perishable Products with Stochastic Demands and Direct Deliveries
In any supply chain, distribution planning of products is of great importance to managers. With effective and flexible distribution planning, mangers can increase the efficiency of time, place, and delivery utility of whole supply chain. In this paper, inventory routing problem (IRP) is applied to distribution planning of perishable products in a supply chain. The studied supply chain is compos...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کامل